Topology Design with Minimal Cost Subject to Network Reliability Constraint

Evaluation of Network Reliability for a Computer Network Subject to a Budget Constraint

This paper constructs a multistate flow network composed of multistate edges to model a computer network. Each edge has lead time, capacity, and cost parameters. Therefore, the minimum transmission time through a single path is not a fixed number. Under the transmission protocol that the data are sent through p (p ≥ 2) minimal paths simultaneously, the minimum transmission time is also stochast...

Cumulative Updating of Network Reliability with Diameter Constraint and Network Topology Optimization

Network Reliability Monte Carlo With Nodes Subject to Failure

We extend the network reliability estimation methodology based on evolution (creation) Monte Carlo into four directions: (i) introducing unreliable nodes; (ii) adjusting the evolution process with merging to "closure" operation suitable for unreliable nodes; (iii) in case of numerical instability in computing convolutions, we suggest a special Monte Carlo algorithm based on importance sampling;...

Fixed Channel Allocation in Wireless Mesh Network Subject to Efficient Spectrum Usage and Reliability Constraint

Reliability is one of the major issues with wireless networks. Failure in multiple radio channels often lead to poor communication even complete disruption in services. Increasing reliability of a network may point to the requirement of multiple paths between two terminals in the network. Hence, a link fault tolerant network design with low cost is important. Fault tolerance of a network is def...

Topological Optimization of a Communication Network Subject to a Reliability Constraint

Conclusions This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, a t a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, ...